Fast circulant block Jacket transform based on the Pauli matrices

نویسندگان

  • Guibo Liu
  • Zhan Wang
  • Dayong Luo
  • Ying Guo
  • Moon Ho Lee
چکیده

Owing to its orthogonality, simplicity of the inversion and fast algorithms, Jacket transform generalising from the Hadamard transform has played important roles in signal and image processing, mobile communication for coding design, cryptography, etc. In this paper, inspired by the emerging block Jacket transform, a new class of circulant block Jacket matrices (CBJMs) are mathematically defined based on the circulant matrix theory. Then the existence conditions for the CBJMs with any size based on the Pauli matrices are explicitly given. Next, by employing the Kroneker product and successive low order basic matrices, the fast algorithms for the construction and decomposition of any high order circulant Pauli block Jacket matrices (CPBJMs) are systematically obtained. Finally, compared to the direct computation (DC), the proposed fast algorithms have a better efficiency, which may be available in many fields, such as signal sequence design, image compression, communication for coding and encoding, quantum signal processing and information theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erratum to: "Fast quantum codes based on Pauli block Jacket matrices"

Jacket matrices motivated by the center weight Hadamard matrices have played an important role in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a design approach for the Pauli block jacket matrix achieved by substituting some Pauli matrices for all elements of common matrices. Since, the well-known Pauli matrices have been widely utilized for...

متن کامل

Arikan and Alamouti matrices based on fast block-wise inverse jacket transform

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to ...

متن کامل

An explicit construction of fast cocyclic jacket transform on the finite field with any size

An orthogonal cocyclic framework of the block-wise inverse Jacket transform (BIJT) is proposed over the finite field. Instead of the conventional block-wise inverse Jacket matrix (BIJM), we investigate the cocyclic block-wise inverse Jacket matrix (CBIJM), where the high-order CBIJM can be factorized into the low-order sparse CBIJMs with a successive block architecture. It has a recursive fashi...

متن کامل

A fast hybrid Jacket-Hadamard matrix based diagonal block-wise transform

In this paper, based on the block (element)-wise inverse Jacket matrix, a unified fast hybrid diagonal block-wise transform (FHDBT) algorithm is proposed. A new fast diagonal block matrix decomposition is made by the matrix product of successively lower order diagonal Jacket matrix and Hadamard matrix. Using a common lower order matrix in the form of 1 1, a fast recursive structure can be devel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJHPCN

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2016